Flow Rounding

نویسندگان

  • Donggu Kang
  • James Payor
چکیده

We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the expected flow along each edge matches the fractional flow. Both problems are reduced to cycle canceling, for which we develop an O(m log n 2 m ) algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental Evaluation of Approximation Algorithms for the Minimum Cost Multiple-source Unsplittable Flow Problem

For the minimum cost multiple-source unsplittable flow problem, we propose a 2-cost and (c+ 2)-congestion approximation algorithm, where c is the number of distinct sources. We also propose some heuristics based on a linear programming relaxation with randomized rounding and a greedy approach, and implement the proposed approximation algorithms and examine the quality of approximation achieved ...

متن کامل

2.1 Randomized Rounding 12.1.1 Min Congestion Routing Problem

xie ≥ 0 ∀i,∀e The sets δ+(v) and δ−(v) correspond to the incoming and outgoing flow, respectively, for vertex v. The summation constraints then enforce flow conservation, and source/sink assignments. Since the objective function is to minimize t, which is constrained to be an upper bound for the flow across any edge, t will give us the (possibly fractional) congestion for a solution point of th...

متن کامل

LP Relaxation , Rounding , and Randomized Rounding

1.1 Max-flow min-cut A flow network is a directed graph D = (V,E) with two distinguished vertices s and t called the source and the sink, respectively. Moreover, each arc (u, v) ∈ E has a certain capacity c(u, v) ≥ 0 assigned to it. Let X be a proper non-empty subset of V . Let X̄ := V −X , then the pair (X, X̄) forms a partition of V , called a cut of D. The set of arcs of D going from X to X̄ is...

متن کامل

Approximate Multicommodity Flow for WDM Networks Design

The design of WDM optical networks is an issue for telecom operators since the spreading of this technology will not occur unless enough performance guarantees are provided. Motivated by the quest for efficient algorithms for the Routing and Wavelength Assignment problem (RWA), we address approximations of the fractional multicommodity flow problem which is the central part of a complex randomi...

متن کامل

Systematic characterization of feature dimensions and closing pressures for microfluidic valves produced via photoresist reflow.

Multilayer soft lithography (MSL) provides a convenient and low-cost method for fabricating poly(dimethyl siloxane) (PDMS) microfluidic devices with on-chip valves for automated and precise control of fluid flow. MSL casting molds for flow channels typically incorporate small patches of rounded positive photoresist at valve locations to achieve the rounded cross-sectional profile required for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1507.08139  شماره 

صفحات  -

تاریخ انتشار 2015